Algorithm for Retrieval of Sub-community Graph from a Compressed Community Graph Using Graph Mining Techniques
نویسندگان
چکیده
منابع مشابه
Finding Community Base on Web Graph Clustering
Search Pointers organize the main part of the application on the Internet. However, because of Information management hardware, high volume of data and word similarities in different fields the most answers to the user s’ questions aren`t correct. So the web graph clustering and cluster placement in corresponding answers helps user to achieve his or her intended results. Community (web communit...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولStudying Community Dynamics with an Incremental Graph Mining Algorithm
The widespread usage of the Web and later of the Web 2.0 for social interactions has stimulated scholars of different disciplines in studying electronic communities. Traditionally, communities are observed as a static phenomenon. However, they are evolving constellations, which emerge, lose members and obtain new ones and potentially, grow, coerce, split or decline. Such dynamic phenomena requi...
متن کاملfinding community base on web graph clustering
search pointers organize the main part of the application on the internet. however, because of information management hardware, high volume of data and word similarities in different fields the most answers to the user s’ questions aren`t correct. so the web graph clustering and cluster placement in corresponding answers helps user to achieve his or her intended results. community (web communit...
متن کاملOmni Graph Mining: Graph mining using RDBMS
In this study, we compare three approaches to implement graph algorithms SQL, MapReduce, and GraphChi in terms of performance and cost efficiency. Since MapReduce was introduced, it has been considered as a standard tool to analyze large scale data including graph data. However, we believe that there is a ‘sweet spot’ in which RDBMS can outperform MapReduce. We think that the performance of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2015
ISSN: 1877-0509
DOI: 10.1016/j.procs.2015.07.444